Dimerized decomposition of quantum evolution on an arbitrary graph
نویسندگان
چکیده
منابع مشابه
lexical decomposition awareness and its effect on delayed receptive and productive recognition and recall of vocabulary knowledge of morphologically complex english words: an iranian efl context
abstract lexical knowledge of complex english words is an important part of language skills and crucial for fluent language use (nation, 2001). the present study, thus, was an attempt to assess the role of morphological decomposition awareness as a vocabulary learning strategy on learners’ productive and receptive recall and recognition of complex english words. so 90 sophomores (female and ma...
15 صفحه اولFast Polar Decomposition of an Arbitrary Matrix
The polar decomposition of an m x n matrix A of full rank, where rn n, can be computed using a quadratically convergent algorithm of Higham SIAMJ. Sci. Statist. Comput., 7 (1986), pp. 1160-1174]. The algorithm is based on a Newton iteration involving a matrix inverse. It is shown how, with the use of a preliminary complete orthogonal decomposition, the algorithm can be extended to arbitrary A. ...
متن کاملEntanglement of Valence-Bond-Solid on an Arbitrary Graph
The Affleck-Kennedy-Lieb-Tasaki (AKLT) spin interacting model can be defined on an arbitrary graph. We explain the construction of the AKLT Hamiltonian. Given certain conditions, the ground state is unique and known as the Valence-BondSolid (VBS) state. It can be used in measurement-based quantum computation as a resource state instead of the cluster state. We study the VBS ground state on an a...
متن کاملOn finding an ear decomposition of an undirected graph distributively
An ear decomposition of a connected undirected graph G= (V ,E) is a partition of the edge (link) set E into a collection of edge-disjoint paths P0,P1, . . . ,P|E|−|V |+1, called ears, such that P0 is a link, P0 ∪P1 is a closed path (i.e., a cycle), and for each i , 2 i |E| − |V | + 1, Pi is a path of which each terminating node belongs to some Pj , j < i , and no internal node belongs to any Pj...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2019
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-019-2532-y